Speedup of Data Vortex Network Architecture

نویسنده

  • Qimin Yang
چکیده

In this paper, routing nodes are proposed to provide speedup and parallel processing capability in Data Vortex network architectures. The new design not only significantly improves network throughput and latency, but also eliminates the need for distributive traffic control mechanism originally embedded among nodes and the need for nodal buffering. The cost effectiveness is studied by a comparison study with the previously proposed 2input buffered networks, and considerable performance enhancement can be achieved with similar or lower cost of hardware. Unlike previous implementation, the network leaves small probability of contention, therefore, the packet drop rate must be kept low for such implementation to be feasible and attractive, and it can be achieved with proper choice of operation conditions. Keyword—Data Vortex, Packet Switch, Interconnection network, deflection, Network-on-chip

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling the Cooling Performance of Vortex Tube Using a Genetic Algorithm-based Artificial Neural Network

In this study, artificial neural networks have been used to model the effects of four important parameters consist of the ratio of the length to diameter, the ratio of the cold outlet diameter to the tube diameter, inlet pressure, and cold mass fraction on the cooling performance of counter flow vortex tube. In this approach, experimental data have been used to train and validate the neural net...

متن کامل

WDM Packet Routing for High-Capacity Data Networks

We present experimental and numerical studies of a novel packet-switch architecture, the data vortex, designed for large-scale photonic interconnections. The selfrouting multihop packet switch efficiently scales to large port counts ( 10 k) while maintaining low latencies, a narrow latency distribution, and high throughput. To facilitate optical implementation, the data-vortex architecture empl...

متن کامل

Emulation of realistic network traffic patterns on an eight-node data vortex interconnection network subsystem

We demonstrate the feasibility of the data vortex interconnection network architecture for use in supercomputing by emulating realistic network traffic on an eight-node subnetwork. The evaluation workload uses memory accesses from the Barnes–Hut application in the SLPASH-2 parallel computing benchmark suite, which was extracted by using the M5 multiprocessor system simulator. We confirm that tr...

متن کامل

Performances of the Data Vortex Switch Architecture Under Nonuniform and Bursty Traffic

The Data Vortex switch architecture has been proposed as a scalable low-latency interconnection fabric for optical packet switches. This self-routed hierarchical architecture employs synchronous timing and distributed traffic-control signaling to eliminate optical buffering and to reduce the required routing logic, greatly facilitating a photonic implementation. In previous work, we have shown ...

متن کامل

An approach to Improve Particle Swarm Optimization Algorithm Using CUDA

The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013